Notions of Equivalence for Discrete Time Ar-representations
نویسندگان
چکیده
A transformation of polynomial matrices which preserves both the finite and infinite elementary divisor structure is presented and related to other known transformations.
منابع مشابه
Fundamental Equivalence of Discrete-Time AR Representations
We examine the problem of equivalence of discrete time auto-regressive representations (DTARRs) over a finite time interval. Two DTARRs are defined as fundamentally equivalent (FE) over a finite time interval [0, N ] if their solution spaces or behaviours are isomorphic. We generalise the concept of strict equivalence (SE) of matrix pencils to the case of general polynomial matrices and in turn...
متن کاملClassification and properties of acyclic discrete phase-type distributions based on geometric and shifted geometric distributions
Acyclic phase-type distributions form a versatile model, serving as approximations to many probability distributions in various circumstances. They exhibit special properties and characteristics that usually make their applications attractive. Compared to acyclic continuous phase-type (ACPH) distributions, acyclic discrete phase-type (ADPH) distributions and their subclasses (ADPH family) have ...
متن کاملPartial Observation in Distributed Supervisory Control of Discrete-Event Systems
Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...
متن کاملBisimulation relations for dynamical, control, and hybrid systems
The fundamental notion of bisimulation equivalence for concurrent processes, has escaped the world of continuous, and subsequently, hybrid systems. Inspired by the categorical framework of Joyal, Nielsen and Winskel, we develop novel notions of bisimulation equivalence for dynamical systems as well as control systems. We prove that this notion can be captured by the abstract notion of bisimulat...
متن کاملChurch, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity
We consider classical representations of integers: Church’s function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entities and require formal representations of objects, we effectivize these abstract notions in order to allow them to be computed by programs. To any such effectivized representation is...
متن کامل